Local search with edge weighting and configuration checking heuristics for minimum vertex cover
نویسندگان
چکیده
Article history: Received 12 October 2010 Received in revised form 20 March 2011 Accepted 21 March 2011 Available online 24 March 2011
منابع مشابه
EWLS: A New Local Search for Minimum Vertex Cover
A number of algorithms have been proposed for the Minimum Vertex Cover problem. However, they are far from satisfactory, especially on hard instances. In this paper, we introduce Edge Weighting Local Search (EWLS), a new local search algorithm for the Minimum Vertex Cover problem. EWLS is based on the idea of extending a partial vertex cover into a vertex cover. A key point of EWLS is to find a...
متن کاملTwo Weighting Local Search for Minimum Vertex Cover
Minimum Vertex Cover (MinVC) is a well known NP-hard combinatorial optimization problem, and local search has been shown to be one of the most effective approaches to this problem. State-of-the-art MinVC local search algorithms employ edge weighting techniques and prefer to select vertices with higher weighted score. These algorithms are not robust and especially have poor performance on instan...
متن کاملTwo New Local Search Strategies for Minimum Vertex Cover
In this paper, we propose two new strategies to design efficient local search algorithms for the minimum vertex cover (MVC) problem. There are two main drawbacks in state-ofthe-art MVC local search algorithms: First, they select a pair of vertices to be exchanged simultaneously, which is time consuming; Second, although they use edge weighting techniques, they do not have a strategy to decrease...
متن کاملNuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
The Minimum Vertex Cover (MVC) problem is a prominent NP-hard combinatorial optimization problem of great importance in both theory and application. Local search has proved successful for this problem. However, there are two main drawbacks in state-of-the-art MVC local search algorithms. First, they select a pair of vertices to exchange simultaneously, which is timeconsuming. Secondly, although...
متن کاملAn Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem in Graph Theory
The connected vertex cover (CVC) problem is a variant of the vertex cover problem, 1 which has many important applications, such as wireless network design, routing and wavelength 2 assignment problem, etc. A good algorithm for the problem can help us improve engineering 3 efficiency, cost savings and resources in industrial applications. In this work, we present an efficient 4 algorithm GRASP-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 175 شماره
صفحات -
تاریخ انتشار 2011